Beyond cuts in small signal scenarios

نویسندگان

چکیده

Abstract We investigate enhancing the sensitivity of new physics searches at LHC by machine learning in case background dominance and a high degree overlap between observables for signal background. use two different models, XGBoost deep neural network, to exploit correlations compare this approach traditional cut-and-count method. consider methods analyze models’ output, finding that template fit generally performs better than simple cut. By means Shapley decomposition, we gain additional insight into relationship event kinematics model output. supersymmetric scenario with metastable sneutrino as concrete example, but methodology can be applied much wider class models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Small Cuts – Creating Small Short Films

Discussions about mobile applications and businesses often deal with technical issues on distribution and representation. Content, when discussed, is typically considered as a set of measurable units, like size, form and version, and left with that. This paper stresses the importance of also regarding content as the result of a creative process. A content theory is presented and used as a backd...

متن کامل

Counting small cuts in a graph

We study the minimum cut problem in the presence of uncertainty and show how to apply a novel robust optimization approach, which aims to exploit the similarity in subsequent graph measurements or similar graph instances, without posing any assumptions on the way they have been obtained. With experiments we show that the approach works well when compared to other approaches that are also oblivi...

متن کامل

Fragile graphs with small independent cuts

A graph is called fragile if it has a vertex cut which is also an independent set. Chen and Yu proved that every graph with n vertices and at most 2n 4 edges is fragile, which was conjectured to be true by Caro. However, their proof does not give any information on the number of vertices in the independent cuts. The purpose of this paper is to investigate when a graph has a small independent cu...

متن کامل

Finding Small Sparse Cuts by Random Walk

We study the problem of finding a small sparse cut in an undirected graph. Given an undirected graph G = (V,E) and a parameter k ≤ |E|, the small sparsest cut problem is to find a set S ⊆ V with minimum conductance among all sets with volume at most k. Using ideas developed in local graph partitioning algorithms, we obtain the following bicriteria approximation algorithms for the small sparsest...

متن کامل

Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts

Spectral clustering is based on the spectral relaxation of the normalized/ratio graph cut criterion. While the spectral relaxation is known to be loose, it has been shown recently that a non-linear eigenproblem yields a tight relaxation of the Cheeger cut. In this paper, we extend this result considerably by providing a characterization of all balanced graph cuts which allow for a tight relaxat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Physical Journal C

سال: 2023

ISSN: ['1434-6044', '1434-6052']

DOI: https://doi.org/10.1140/epjc/s10052-023-11532-9